Applications of the finite state automata for counting restricted permutations and variations
نویسندگان
چکیده
منابع مشابه
Counting permutations and polynomials with a restricted factorization pattern
We determine the asymptoti probability that a polynomial of degree n over a nite eld with q elements has no more than k irredu ible fa tors of any degree, for ea h natural number k. In parti ular we show that when q is large, almost 90% of su h polynomials have no more than 2 irredu ible fa tors of any given degree and almost 98% have no more than 3 irredu ible fa tors of any given degree. Simi...
متن کاملPrediction with Restricted Resources and Finite Automata
We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state automata with a specified number, m, of states to the set of all binary sequences...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملOn Emptiness and Counting for Alternating Finite Automata
We investigate problems for regular languages coded by alternating nite automata. In automata and formal language theory, it is well-known that there is a language accepted by an n-state nondeterministic nite automaton but any deterministic nite automaton accepting that language must have at least 2 n states. Diierent representations of regular languages are used to deene problems of varying le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2012
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor120211023b